Approximate Resolution of Hard Numbering

نویسنده

  • Olivier Bailleux
چکیده

We present a new method for estimating the number of solutions of constraint satisfaction problems 1. We use a stochastic forward checking algorithm for drawing a sample of paths from a search tree. With this sample, we compute two values related to the number of solutions of a CSP instance. First, an unbiased estimate , second, a lower bound with an arbitrary low error probability. We will describe applications to the Boolean Satissability problem and the Queens problem. We shall give some experimental results for these problems.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Elimination of Hard-Nonlinearities Destructive Effects in Control Systems Using Approximate Techniques

Many of the physical phenomena, like friction, backlash, drag, and etc., which appear in mechanical systems are inherently nonlinear and have destructive effects on the control systems behavior. Generally, they are modeled by hard nonlinearities. In this paper, two different methods are proposed to cope with the effects of hard nonlinearities which exist in friction various models. Simple inver...

متن کامل

Progressive transmission of color-mapped images

Coded as conventional color-map addresses, a colormapped image can be decoded only when a full color map address is available. We present the first known scheme that adds progression capability in spatial resolution as well as color resolution, enabling more flexible progression of color-mapped images. During coding, approximate pixel colors are keyed with truncated versions of the original col...

متن کامل

Approximations to the Halting Problem

The halting set Kr = (x I r converges}, for any G6del numbering ~ = {~0, ~1 ,-..}, is nonrecursive. It may be possible, however, to approximate Kr by recursive s e t s . We note several results indicating that the degrees of recursive approximability of halting sets in arbitrary GSdel numberings have wide variation, while restriction to "optimal GSdel numberings" only narrows the possibilities ...

متن کامل

Resolution composite shell with a layer of piezoelectric vibration analysis

In this paper, the vibration of composite cylindrical shell with piezoelectric layers in the interior and exterior surfaces is investigated. The composite shell without piezoelectric layers can be studied and compared the results with the results of other researchers, the cylindrical shell laminated with layers of piezoelectric vibration checked. The result is a three-dimensional elasticity equ...

متن کامل

Supplement - Learning Sparse Causal Models is not NP-hard

This article contains detailed proofs and additional examples related to the UAI-2013 submission ‘Learning Sparse Causal Models is not NP-hard’. The supplement follows the numbering in the main submission.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996